Pii: S0167-2789(98)00053-0
نویسندگان
چکیده
There had been well-known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy generally requires a quantum computer. We emphasize the generality of this "no-go theorem": Unconditionally secure bit commitment schemes based on quantum mechanics-fully quantum, classical or quantum but with measurements-are all ruled out by this result. Since bit commitment is a useful primitive for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called "postcold-war" applications. We also show that ideal quantum coin tossing is impossible because of the EPR attack. This no-go theorem for ideal quantum coin tossing may help to shed some lights on the possibility of non-ideal protocols. © 1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0167-2789(98)00051-7
It is shown that the minimum energy required to transmit a natural unit of information (nat) over a noisy channel is k T, where T is the effective noise temperature which depends on the interaction between the information career and the environment. The result follows from the entropy defect principle and general laws of quantum dynamics without any specific assumptions. © 1998 Published by Els...
متن کاملPii: S0167-2789(98)00168-7
We compare two algorithms for the numerical estimation of the correlation dimension from a finite set of vectors: the "classical" algorithm of Grassberger and Procaccia (GPA) and the recently proposed algorithm of Judd (JA). Data set size requirements and their relations to systematic and statistical errors of the estimates are investigated. It is demonstrated that correlation dimensions of the...
متن کاملPii: S0167-2789(98)00047-5
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly ef...
متن کاملPii: S0167-2789(98)00054-2
We discuss the problem of counting the maximum number of distinct states that an isolated physical system can pass through in a given period of time its maximum speed of dynamical evolution. Previous analyses have given bounds in terms of AE, the standard deviation of the energy of the system; here we give a strict bound that depends only on E E0, the system's average energy minus its ground st...
متن کامل